undirected graphs造句
例句與造句
- a circ is an undirected graph having only vertices of even nonzero degree .
一廣義圈是一無向圖，其頂點次數(shù)都是非零偶數(shù)。 - the super restricted edge connectivity of kautz undirected graphs
圖的超級限制邊連通性 - graphs studied in this dissertation are finit, simple, undirected graphs
本文所涉及的圖均為無向、簡單的有限圖。 - abstract : broadcast networks can be expressed by a simple connected undirected graph
文摘:將廣播網(wǎng)絡用簡單連通的無向圖表示。 - first, define the palm-line undirected graph according to the palm-lines ’ character
首先,根據(jù)掌紋線的特點,對掌紋線無向圖進行了嚴格定義。 - It's difficult to find undirected graphs in a sentence. 用undirected graphs造句挺難的
- the theory of graphs can be roughly partitioned into two branches : the areas of undirected graphs and directed graphs ( digraphs )
圖論大致可分為兩個方向：無向圖與有向圖。 - then, advance an algorithm for constructing the palm-line undirected graph according to the connection of the points on the palm-line
其次,根據(jù)掌紋線上各點的連結(jié)情況,提出一種掌紋線無向圖的構(gòu)建算法。 - a simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive . this thesis consists of two parts
如果一個簡單的無向圖是正則的，邊傳遞但不是點傳遞的，那么稱它是半對稱的。 - all graphs are finite simple undirected graph with no isolated vertices in this paper . it is completed the classification of graphs on which a semidihedral group acts edge-transitively
摘要運用圖的自同構(gòu)理論，獲得了關(guān)于半二面體群邊傳遞的圖的完全分類。 - observing lots of palm images and their palm-line undirected graph and analyzing the experts ’ knowledge, we extract the recognition features of cross structure and mi structure
觀察大量的手掌圖像及其相應的掌紋線無向圖,并結(jié)合手掌診病專家知識,分別提取出十字紋和米字紋的識別特征。 - referring to the knowledge of palm diagnosis; this dissertation mainly studies the method to these special structures ’ recognition in the automated palm diagnosis system . the research includes following parts : 1 . the denotation of the palm-line undirected graph
結(jié)合手掌診病知識,本文主要針對自動手掌診病系統(tǒng)中奇異紋的識別作了較深入的研究,主要研究內(nèi)容包括:1.研究掌紋線無向圖的表示算法。 - in chapter 4, the conception of binding number of undirected graphs is introduced to digraphs, based on which the relationship between degree condition of vertices and girth is generalized to the relationship between neighborhood condition of vertices sets and girth
由于若無向圖g的結(jié)合數(shù)b(g)3/2，則g中存在三角形，而caccetta-h(?)ggkvist猜想研究有向圖中存在有向三角形的條件，受此啟發(fā)，我們在有點向圖中引入結(jié)合數(shù)的概念。 - firstly, we study some models which are often used in reconstructing gene regulatory networks, weighed matrices model, boolean networks model, mutual-information networks model, linear combination model, directed graphs and undirected graphs, bayesian networks model and analyze the strengths and weakness of each model by discussing each model ’ s details
首先,我們探討了用于推斷基因表達調(diào)控網(wǎng)絡的一些常用模型,加權(quán)矩陣模型、布爾網(wǎng)絡模型、互信息關(guān)聯(lián)網(wǎng)絡模型、線性組合模型、有向圖和無向圖以及貝葉斯網(wǎng)絡模型。逐個分析了每種方法的優(yōu)缺點。